Sachs′ Linkless Embedding Conjecture
نویسندگان
چکیده
منابع مشابه
About the Connes Embedding Conjecture
In his celebrated paper in 1976, A. Connes casually remarked that any finite von Neumann algebra ought to be embedded into an ultraproduct of matrix algebras, which is now known as the Connes embedding conjecture or problem. This conjecture became one of the central open problems in the field of operator algebras since E. Kirchberg’s seminal work in 1993 that proves it is equivalent to a variet...
متن کاملA polynomial-time algorithm to find a linkless embedding of a graph
A Z-linkless embedding of a graph is an embedding in 3-space such that each pair of disjoint circuits has zero linking number. In this paper we present polynomial-time algorithms to compute a Z-linkless embedding of a graph provided the graph has one and to test whether an embedding of a graph is Z-linkless or not.
متن کاملThe embedding conjecture for quasi-ordinary hypersurfaces
This paper has two objectives: we first generalize the theory of Abhyankar-Moh to quasi-ordinary polynomials, then we use the notion of approximate roots and that of generalized Newton polygons in order to prove the embedding conjecture for this class of polynomials. This conjecture -made by S.S. Abhyankar and A. Sathayesays that if a hypersurface of the affine space is isomorphic to a coordina...
متن کاملLinkless Embeddings of Graphs in 3-space
We announce results about flat (linkless) embeddings of graphs in 3space. A piecewise-linear embedding of a graph in 3-space is called flat if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have shown: (i) An embedding is flat if and only if the fundamental group of the complement in 3-space of the embedding of every subgraph is free. (ii) If two flat embedding...
متن کاملEmbedding the 3x + 1 Conjecture in a 3x + d Context
1991 Mathematics Subject Classi cation: Primary, 11K31, 11K38, 11K55; Secondary: 11B85.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1995
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1032